A cycle lemma for permutation inversions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Permutation Regularity Lemma

We introduce a permutation analogue of the celebrated Szemerédi Regularity Lemma, and derive a number of consequences. This tool allows us to provide a structural description of permutations which avoid a specified pattern, a result that permutations which scatter small intervals contain all possible patterns of a given size, a proof that every permutation avoiding a specified pattern has a nea...

متن کامل

On the tenacity of cycle permutation graph

A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation graphs.

متن کامل

The Permutation Lemma of Richard Brauer

Dear Charlie, I promised to write to you about the "characteristic-free" extension of Richard Brauer's Lemma: if a row permutation and a column permutation have the same effect on a nonsingular matrix, the two permutations must have the same number of cycles of any given length. Differently put: if two permutation matrices are conjugate in the general linear group, they are already conjugate in...

متن کامل

on the tenacity of cycle permutation graph

a special class of cubic graphs are the cycle permutation graphs. a cycle permutation graph pn( α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.in this paper we determine a good upper bound for tenacity of cycle permutation graphs.

متن کامل

M ay 2 00 4 A Permutation Regularity Lemma

We introduce a permutation analogue of the celebrated Szemerédi Regularity Lemma, and derive a number of consequences. This tool allows us to provide a structural description of permutations which avoid a specified pattern, a result that permutations which scatter small intervals contain all possible patterns of a given size, a proof that every permutation avoiding a specified pattern has a nea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2002

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(02)00254-6